Tate-pairing implementations for tripartite key agreement
نویسندگان
چکیده
منابع مشابه
ID-Based One Round Authenticated Tripartite Key Agreement Protocol with Pairings
With various applications of Weil pairing (Tate pairing) to cryptography, ID-based encryption schemes, digital signature schemes, blind signature scheme, two-party authenticated key agreement schemes, and tripartite key agreement scheme were proposed recently, all of them using bilinear pairing (Weil or Tate pairing). In this paper, we propose an ID-based one round authenticated tripartite key ...
متن کاملIEEE 1363.3 Submission: Implicitly Authenticated ID-Based Key Agreement Protocol
In this submission, we propose an efficient identity-based and implicitly authenticated key agreement protocol IDAK based on pairing techniques. Though both Weil and Tate pairing could be used for IDAK, we recommend Tate pairing for IDAK to avoid extra ephemeral value validation process. The security of IDAK was formally proved in [22] in Bellare-Rogaway model with random oracle. In additon, ID...
متن کاملAn Improved Tripartite Authenticated Key Agreement Protocol Based on Weil Pairing
This paper examines the security weaknesses of Lin, Huang and Lin’s tripartite authenticated key agreement scheme, and proposes our new scheme. The proposed scheme resists all the security threats and further provides key confirmation. The scheme is very simple and efficient.
متن کاملAn Introduction to Pairing-Based Cryptography
Bilinear pairings have been used to design ingenious protocols for such tasks as one-round three-party key agreement, identity-based encryption, and aggregate signatures. Suitable bilinear pairings can be constructed from the Tate pairing for specially chosen elliptic curves. This article gives an introduction to the protocols, Tate pairing computation, and curve selection.
متن کاملTate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pairing. Hence it is necessary to develop more efficient implementations of the Tate pairing for the practical application of pairing based cryptosystems. In 2002, Barreto et al. and Galbraith et al. provided new algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2003 شماره
صفحات -
تاریخ انتشار 2003